Eulerian subgraphs containing given edges

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eulerian subgraphs containing given edges

For an integer l¿0, de ne SE(l) to be the family of graphs such that G ∈SE(l) if and only if for any edge subset X ⊆E(G) with |X |6l, G has a spanning eulerian subgraph H with X ⊆E(H). The graphs in SE(0) are known as supereulerian graphs. Let f(l) be the minimum value of k such that every k-edge-connected graph is in SE(l). Jaeger and Catlin independently proved f(0) = 4. We shall determine f(...

متن کامل

Eulerian Subgraphs Containing Given Vertices

A vertex set S ⊆ V (G) is k-weak-edge-connected if for every C ⊂ S and x ∈ S−C there are min{k, |C|} edge-disjoint (x,C)-paths in G. For a graph G and a k-weakedge-connected vertex set S ⊂ V (G) with k ≥ 3 and 4 ≤ |S| ≤ 2k, we show that G has an eulerian subgraph containing all vertices in S.

متن کامل

Eulerian subgraph containing given vertices

A vertex set S ⊆ V (G) is k-weak-edge-connected if for every C ⊂ S and x ∈ S−C there are min{k, |C|} edge-disjoint (x,C)-paths in G. For a graph G and a k-weakedge-connected vertex set S ⊂ V (G) with k ≥ 3 and 4 ≤ |S| ≤ 2k, we show that G has an eulerian subgraph containing all vertices in S.

متن کامل

Spanning trails containing given edges

A graph G is Eulerian-connected if for any u and v in V (G), G has a spanning (u. v)-trail. A graph G is edge-Eulerian-connected if for any e' and elf in E(G), G has a spanning (e', elf)-trail. For an integer r ~ 0, a graph is called r-Eulerian-connected if for any X s::: E(G) with IXI ~r, and for any u, v E V(G), G has a spanning (u, v)-trail T such that X s::: E(T). The r-edge-Eulerian­ conne...

متن کامل

On the Number of Certain Subgraphs Contained in Graphs with a given Number of Edges

All graphs considered are finite, undirected, with no loops, no multiple edges and no isolated vertices. For two graphs G, H, let N(G, H) denote the number of subgraphs of G isomorphic to H. Define also, for l >=0, N(I,H)= max N(G, H), where the maximum is taken over all graphs G with l edges. We determine N(l, H) precisely for all l -> 0 when H is a disjoint union of two stars, and also when H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2001

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(00)00070-4